Almost all cancellative triple systems are tripartite
نویسندگان
چکیده
A triple system is cancellative if no three of its distinct edges satisfy A ∪ B = A ∪ C. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is cancellative. We prove that almost all cancellative triple systems with vertex set [n] are tripartite. This sharpens a theorem of Nagle and Rödl [15] on the number of cancellative triple systems. It also extends recent work of Person and Schacht [16] who proved a similar result for triple systems without the Fano configuration. Our proof uses the hypergraph regularity lemma of Frankl and Rödl [11], and a stability theorem for cancellative triple systems due to Keevash and the second author [12].
منابع مشابه
Stability theorems for cancellative hypergraphs
A cancellative hypergraph has no three edges A;B;C with ADBCC: We give a new short proof of an old result of Bollobás, which states that the maximum size of a cancellative triple system is achieved by the balanced complete tripartite 3-graph. One of the two forbidden subhypergraphs in a cancellative 3-graph is F5 1⁄4 fabc; abd; cdeg: For nX33 we show that the maximum number of triples on n vert...
متن کاملAlmost all triangle-free triple systems are tripartite
A triangle in a triple system is a collection of three edges isomorphic to {123, 124, 345}. A triple system is triangle-free if it contains no three edges forming a triangle. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is triangle-free. We prove that almost all trian...
متن کاملAlmost all Steiner triple systems have perfect matchings
We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a un...
متن کاملNoninvadability implies noncoexistence for a class of cancellative systems ∗
There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a sort of converse statement for a class of one-dimensional cancellative systems that are used to model balancing selection. We say that a model exhibits strong interface tightness if started from a conf...
متن کاملOn an Open Problem of U. Höhle - A Characterization of Conditionally Cancellative T-Subnorms
In this work we solve an open problem of U.Höhle [Problem 11, Fuzzy Sets and Systems 145 (2004) 471-479]. We show that the solution gives a characterization of all conditionally cancellative t-subnorms. Further, we give an equivalence condition for a conditionally cancellativite t-subnorm to be a t-norm and hence show that conditionally cancellativite t-subnorms whose natural negations are stro...
متن کامل